The SDL specification of the sliding window protocol revisited
نویسندگان
چکیده
We present the results of a case study in which the use of SDL tools was analysed on the basis of the sliding window protocol We chose the SDL speci cation of the protocol which was rst published by the ISO While editing and simulating the SDL speci cation we found out that the speci cation contains signi cant errors and does not meet the informal description of the protocol We describe these errors and give a correct version of the SDL speci cation
منابع مشابه
The SDL Speci cation of the Sliding Window Protocol Revisited
This paper is a corrigendum to the SDL speci cation of the sliding window protocol which was rst published by the ISO IEC as a technical report We present some results of a tool supported simulation of the SDL speci cation of the sliding window protocol We found out that the speci cation contains signi cant errors and does not meet the informal description of the protocol In this paper we descr...
متن کاملThe Sliding-Window Protocol in CSP
A formal specification and proof of correctness is given of the sliding window protocol using the notation of Communicating Sequential Pro cesses. First the stop-and-wait protocol is defined; its correetne8S, that it forms a I-place buffer, is almost evident. Next the alternating-bit protocol is defined and described in terms of the stop-and-wait proto col, and its correctness deduced. Final...
متن کاملSDL Section Outline of FORMAL METHODS FOR SPECIFICATION AND ANALYSIS OF COMMUNICATION PROTOCOLS
Data Types (ADT) is used to characterize variable and parameter types through inheritance to avoid redundant redefinition of common operators and to define parametric data types. Communication on bidirectional routes between processes is asynchronous in SDL, and synchronous communication is provided by the remote-procedure call instruction. Also a non-ordered signal reception is supported by SD...
متن کاملVerification of a sliding window protocol in μCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS. Keywords— μCRL, branching bisimulation, ...
متن کاملSoftware ENgineering Verifying a Sliding Window Protocol in mCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory. 2000 Mathematics Subject Classification: 68N30 [Specification and verification]; 68Q85 [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997